Selecting Routing Paths for Sending Encoded Data Slices

ABSTRACT

A method includes dispersed storage error encoding a data object to produce a set of encoded data slices. The method further includes obtaining routing path performance information for a plurality of routing paths from the computing device to a set of storage units. The method further includes selecting a first routing path for sending a first subset of the set of encoded data slices, where the first routing path has a performance level greater than a first performance threshold. The method further includes selecting a second routing path for sending a second subset of the set of encoded data slices, where the second routing path has a performance level less than or equal to the first performance threshold. The method further includes sending the first and second subsets of encoded data slices to the set of storage units via the first and second routing paths for storage therein.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority pursuant to 35 U.S.C. § 120 as acontinuation of U.S. Utility application Ser. No. 17/249,539, entitled“DETERMINING AN ERROR ENCODING FUNCTION RATIO BASED ON PATHPERFORMANCE,” filed Mar. 4, 2021, which is a continuation of U.S.Utility application Ser. No. 16/378,041, entitled “ADJUSTING DISPERSEDSTORAGE ERROR ENCODING PARAMETERS BASED ON PATH PERFORMANCE,” filed Apr.8, 2019, issued as U.S. Pat. No. 10,970,168 on Apr. 6, 2021, which is acontinuation-in-part of U.S. Utility application Ser. No. 15/817,104,entitled “CONTENT-BASED ENCODING IN A MULTIPLE ROUTING PATHCOMMUNICATIONS SYSTEM,” filed Nov. 17, 2017, issued as U.S. Pat. No.10,298,957 on May 21, 2019, which is a continuation-in-part of U.S.Utility application Ser. No. 14/615,655, entitled “OPTIMIZING ROUTING OFDATA ACROSS A COMMUNICATIONS NETWORK,” filed Feb. 6, 2015, issued asU.S. Pat. No. 9,843,412 on Dec. 12, 2017, which is acontinuation-in-part of U.S. Utility application Ser. No. 13/251,603,entitled “RELAYING DATA TRANSMITTED AS ENCODED DATA SLICES,” filed Oct.3, 2011, issued as U.S. Pat. No. 9,037,937 on May 19, 2015, which claimspriority pursuant to 35 U.S.C. § 119(e) to U.S. Provisional ApplicationNo. 61/390,472, entitled “COMMUNICATIONS UTILIZING INFORMATIONDISPERSAL,” filed Oct. 6, 2010, expired, all of which are herebyincorporated herein by reference in their entirety and made part of thepresent U.S. Utility Patent Application for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not Applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computer networks and moreparticularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/orstore data. Such computing devices range from wireless smart phones,laptops, tablets, personal computers (PC), work stations, and video gamedevices, to data centers that support millions of web searches, stocktrades, or on-line purchases every day. In general, a computing deviceincludes a central processing unit (CPU), a memory system, userinput/output interfaces, peripheral device interfaces, and aninterconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using“cloud computing” to perform one or more computing functions (e.g., aservice, an application, an algorithm, an arithmetic logic function,etc.) on behalf of the computer. Further, for large services,applications, and/or functions, cloud computing may be performed bymultiple cloud computing resources in a distributed manner to improvethe response time for completion of the service, application, and/orfunction. For example, Hadoop is an open source software framework thatsupports distributed applications enabling application execution bythousands of computers.

In addition to cloud computing, a computer may use “cloud storage” aspart of its memory system. As is known, cloud storage enables a user,via its computer, to store files, applications, etc. on an Internetstorage system. The Internet storage system may include a RAID(redundant array of independent disks) system and/or a dispersed storagesystem that uses an error correction scheme to encode data for storage.

Data can be sent via one or more routing paths in a multiple routingpath communication system.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an errorencoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an errorencoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of anencoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an errordecoding function in accordance with the present invention;

FIG. 9 is a schematic block diagram of another embodiment of thedispersed or distributed storage network (DSN) in accordance with thepresent invention;

FIG. 10 is a schematic block diagram of another embodiment of thedispersed or distributed storage network (DSN) in accordance with thepresent invention; and

FIG. 11 is a logic diagram of an example of a method of adjustingdispersed error encoding parameters based on routing path performance inaccordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, ordistributed, storage network (DSN) 10 that includes a plurality ofcomputing devices 12-16, a managing unit 18, an integrity processingunit 20, and a DSN memory 22. The components of the DSN 10 are coupledto a network 24, which may include one or more wireless and/or wirelined communication systems; one or more non-public intranet systemsand/or public internet systems; and/or one or more local area networks(LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may belocated at geographically different sites (e.g., one in Chicago, one inMilwaukee, etc.), at a common site, or a combination thereof. Forexample, if the DSN memory 22 includes eight storage units 36, eachstorage unit is located at a different site. As another example, if theDSN memory 22 includes eight storage units 36, all eight storage unitsare located at the same site. As yet another example, if the DSN memory22 includes eight storage units 36, a first pair of storage units are ata first common site, a second pair of storage units are at a secondcommon site, a third pair of storage units are at a third common site,and a fourth pair of storage units are at a fourth common site. Notethat a DSN memory 22 may include more or less than eight storage units36. Further note that each storage unit 36 includes a computing core (asshown in FIG. 2 , or components thereof) and a plurality of memorydevices for storing dispersed error encoded data.

Each of the computing devices 12-16, the managing unit 18, and theintegrity processing unit 20 include a computing core 26, which includesnetwork interfaces 30-33. Computing devices 12-16 may each be a portablecomputing device and/or a fixed computing device. A portable computingdevice may be a social networking device, a gaming device, a cell phone,a smart phone, a digital assistant, a digital music player, a digitalvideo player, a laptop computer, a handheld computer, a tablet, a videogame controller, and/or any other portable device that includes acomputing core. A fixed computing device may be a computer (PC), acomputer server, a cable set-top box, a satellite receiver, a televisionset, a printer, a fax machine, home entertainment equipment, a videogame console, and/or any type of home or office computing equipment.Note that each of the managing unit 18 and the integrity processing unit20 may be separate computing devices, may be a common computing device,and/or may be integrated into one or more of the computing devices 12-16and/or into one or more of the storage units 36.

Each interface 30, 32, and 33 includes software and hardware to supportone or more communication links via the network 24 indirectly and/ordirectly. For example, interface 30 supports a communication link (e.g.,wired, wireless, direct, via a LAN, via the network 24, etc.) betweencomputing devices 14 and 16. As another example, interface 32 supportscommunication links (e.g., a wired connection, a wireless connection, aLAN connection, and/or any other type of connection to/from the network24) between computing devices 12 & 16 and the DSN memory 22. As yetanother example, interface 33 supports a communication link for each ofthe managing unit 18 and the integrity processing unit 20 to the network24.

Computing devices 12 and 16 include a dispersed storage (DS) clientmodule 34, which enables the computing device to dispersed storage errorencode and decode data as subsequently described with reference to oneor more of FIGS. 3-8 . In this example embodiment, computing device 16functions as a dispersed storage processing agent for computing device14. In this role, computing device 16 dispersed storage error encodesand decodes data on behalf of computing device 14. With the use ofdispersed storage error encoding and decoding, the DSN 10 is tolerant ofa significant number of storage unit failures (the number of failures isbased on parameters of the dispersed storage error encoding function)without loss of data and without the need for a redundant or backupcopies of the data. Further, the DSN 10 stores data for an indefiniteperiod of time without data loss and in a secure manner (e.g., thesystem is very resistant to unauthorized attempts at accessing thedata).

In operation, the managing unit 18 performs DS management services. Forexample, the managing unit 18 establishes distributed data storageparameters (e.g., vault creation, distributed storage parameters,security parameters, billing information, user profile information,etc.) for computing devices 12-14 individually or as part of a group ofuser devices. As a specific example, the managing unit 18 coordinatescreation of a vault (e.g., a virtual memory block associated with aportion of an overall namespace of the DSN) within the DSN memory 22 fora user device, a group of devices, or for public access and establishesper vault dispersed storage (DS) error encoding parameters for a vault.The managing unit 18 facilitates storage of DS error encoding parametersfor each vault by updating registry information of the DSN 10, where theregistry information may be stored in the DSN memory 22, a computingdevice 12-16, the managing unit 18, and/or the integrity processing unit20.

The DSN managing unit 18 creates and stores user profile information(e.g., an access control list (ACL)) in local memory and/or withinmemory of the DSN memory 22. The user profile information includesauthentication information, permissions, and/or the security parameters.The security parameters may include encryption/decryption scheme, one ormore encryption keys, key generation scheme, and/or dataencoding/decoding scheme.

The DSN managing unit 18 creates billing information for a particularuser, a user group, a vault access, public vault access, etc. Forinstance, the DSN managing unit 18 tracks the number of times a useraccesses a non-public vault and/or public vaults, which can be used togenerate a per-access billing information. In another instance, the DSNmanaging unit 18 tracks the amount of data stored and/or retrieved by auser device and/or a user group, which can be used to generate aper-data-amount billing information.

As another example, the managing unit 18 performs network operations,network administration, and/or network maintenance. Network operationsincludes authenticating user data allocation requests (e.g., read and/orwrite requests), managing creation of vaults, establishingauthentication credentials for user devices, adding/deleting components(e.g., user devices, storage units, and/or computing devices with a DSclient module 34) to/from the DSN 10, and/or establishing authenticationcredentials for the storage units 36. Network administration includesmonitoring devices and/or units for failures, maintaining vaultinformation, determining device and/or unit activation status,determining device and/or unit loading, and/or determining any othersystem level operation that affects the performance level of the DSN 10.Network maintenance includes facilitating replacing, upgrading,repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missingencoded data slices. At a high level, the integrity processing unit 20performs rebuilding by periodically attempting to retrieve/list encodeddata slices, and/or slice names of the encoded data slices, from the DSNmemory 22. For retrieved encoded slices, they are checked for errors dueto data corruption, outdated version, etc. If a slice includes an error,it is flagged as a ‘bad’ slice. For encoded data slices that were notreceived and/or not listed, they are flagged as missing slices. Badand/or missing slices are subsequently rebuilt using other retrievedencoded data slices that are deemed to be good slices to produce rebuiltslices. The rebuilt slices are stored in the DSN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (IO)controller 56, a peripheral component interconnect (PCI) interface 58,an IO interface module 60, at least one IO device interface module 62, aread only memory (ROM) basic input output system (BIOS) 64, and one ormore memory interface modules. The one or more memory interfacemodule(s) includes one or more of a universal serial bus (USB) interfacemodule 66, a host bus adapter (HBA) interface module 68, a networkinterface module 70, a flash interface module 72, a hard drive interfacemodule 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operatingsystem (OS) file system interface (e.g., network file system (NFS),flash file system (FFS), disk file system (DFS), file transfer protocol(FTP), web-based distributed authoring and versioning (WebDAV), etc.)and/or a block memory interface (e.g., small computer system interface(SCSI), internet small computer system interface (iSCSI), etc.). The DSNinterface module 76 and/or the network interface module 70 may functionas one or more of the interface 30-33 of FIG. 1 . Note that the IOdevice interface module 62 and/or the memory interface modules 66-76 maybe collectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data. When a computing device 12 or 16 has data tostore it disperse storage error encodes the data in accordance with adispersed storage error encoding process based on dispersed storageerror encoding parameters. The dispersed storage error encodingparameters include an encoding function (e.g., information dispersalalgorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding,non-systematic encoding, on-line codes, etc.), a data segmentingprotocol (e.g., data segment size, fixed, variable, etc.), and per datasegment encoding values. The per data segment encoding values include atotal, or pillar width, number (T) of encoded data slices per encodingof a data segment i.e., in a set of encoded data slices); a decodethreshold number (D) of encoded data slices of a set of encoded dataslices that are needed to recover the data segment; a read thresholdnumber (R) of encoded data slices to indicate a number of encoded dataslices per set to be read from storage for decoding of the data segment;and/or a write threshold number (W) to indicate a number of encoded dataslices per set that must be accurately stored before the encoded datasegment is deemed to have been properly stored. The dispersed storageerror encoding parameters may further include slicing information (e.g.,the number of encoded data slices that will be created for each datasegment) and/or slice security information (e.g., per encoded data sliceencryption, compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as theencoding function (a generic example is shown in FIG. 4 and a specificexample is shown in FIG. 5 ); the data segmenting protocol is to dividethe data object into fixed sized data segments; and the per data segmentencoding values include: a pillar width of 5, a decode threshold of 3, aread threshold of 4, and a write threshold of 4. In accordance with thedata segmenting protocol, the computing device 12 or 16 divides the data(e.g., a file (e.g., text, video, audio, etc.), a data object, or otherdata arrangement) into a plurality of fixed sized data segments (e.g., 1through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more).The number of data segments created is dependent of the size of the dataand the data segmenting protocol.

The computing device 12 or 16 then disperse storage error encodes a datasegment using the selected encoding function (e.g., Cauchy Reed-Solomon)to produce a set of encoded data slices. FIG. 4 illustrates a genericCauchy Reed-Solomon encoding function, which includes an encoding matrix(EM), a data matrix (DM), and a coded matrix (CM). The size of theencoding matrix (EM) is dependent on the pillar width number (T) and thedecode threshold number (D) of selected per data segment encodingvalues. To produce the data matrix (DM), the data segment is dividedinto a plurality of data blocks and the data blocks are arranged into Dnumber of rows with Z data blocks per row. Note that Z is a function ofthe number of data blocks created from the data segment and the decodethreshold number (D). The coded matrix is produced by matrix multiplyingthe data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encodingwith a pillar number (T) of five and decode threshold number of three.In this example, a first data segment is divided into twelve data blocks(D1-D12). The coded matrix includes five rows of coded data blocks,where the first row of X11-X14 corresponds to a first encoded data slice(EDS 1_1), the second row of X21-X24 corresponds to a second encodeddata slice (EDS 2_1), the third row of X31-X34 corresponds to a thirdencoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to afourth encoded data slice (EDS 4_1), and the fifth row of X51-X54corresponds to a fifth encoded data slice (EDS 5_1). Note that thesecond number of the EDS designation corresponds to the data segmentnumber.

Returning to the discussion of FIG. 3 , the computing device alsocreates a slice name (SN) for each encoded data slice (EDS) in the setof encoded data slices. A typical format for a slice name 60 is shown inFIG. 6 . As shown, the slice name (SN) 60 includes a pillar number ofthe encoded data slice (e.g., one of 1-T), a data segment number (e.g.,one of 1— Y), a vault identifier (ID), a data object identifier (ID),and may further include revision level information of the encoded dataslices. The slice name functions as, at least part of, a DSN address forthe encoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the computing device 12 or 16 produces aplurality of sets of encoded data slices, which are provided with theirrespective slice names to the storage units for storage. As shown, thefirst set of encoded data slices includes EDS 1_1 through EDS 5_1 andthe first set of slice names includes SN 1_1 through SN 5_1 and the lastset of encoded data slices includes EDS 1_Y through EDS 5_Y and the lastset of slice names includes SN 1_Y through SN 5_Y.

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of a data object that was dispersed storage error encodedand stored in the example of FIG. 4 . In this example, the computingdevice 12 or 16 retrieves from the storage units at least the decodethreshold number of encoded data slices per data segment. As a specificexample, the computing device retrieves a read threshold number ofencoded data slices.

To recover a data segment from a decode threshold number of encoded dataslices, the computing device uses a decoding function as shown in FIG. 8. As shown, the decoding function is essentially an inverse of theencoding function of FIG. 4 . The coded matrix includes a decodethreshold number of rows (e.g., three in this example) and the decodingmatrix in an inversion of the encoding matrix that includes thecorresponding rows of the coded matrix. For example, if the coded matrixincludes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2,and 4, and then inverted to produce the decoding matrix.

FIG. 9 is a schematic block diagram of another embodiment of thedispersed or distributed storage network (DSN) that includes computingdevice 12 or 16 and a set of storage units (SUs) 82. The set of storageunits 82 includes eight storage units SUs #1-#8 36. Computing device 12or 16 dispersed storage error encodes a data object into a plurality ofsets of encoded data slices (EDSs) and sends the plurality of sets ofencoded data slices to the set of storage units 82 via one or morerouting paths 1-6 for storage therein. Routing paths 1-6 include one ormore wireless connections and/or lossy wired connections.

Computing device 12 or 16 determines routing path performanceinformation 84 for routing paths 1-6 with respect to the set of storageunits 82. Routing path performance information 84 includes a number ofencoded data slices of each of the plurality of sets of encoded dataslices sent to the set of storage units 82 during a time period, anumber of encoded data slices of each of the plurality of sets ofencoded data slices successfully stored by the set of storage units 82during the time period, and an error rate associated with the set ofstorage units 82 based on the number of encoded data slices sent and thenumber of encoded data slices successfully stored.

As a specific example, during a time period, five sets of encoded dataslices (e.g., a data object is dispersed storage error encoded toproduce five sets of encoded data slices) are sent to the set of storageunits 82 via routing paths 1-6 for storage therein. The sets of encodeddata slices have a pillar width of 5 and a decode threshold of 3.Therefore, the five sets of encoded data slices are sent to five storageunits of the set of storage units. For example, EDSs 1_1-1_5 are sent toSU #1 via routing path 1, EDSs 4_1-4_5 are sent to SU #4 via routingpath 3, EDSs 2_1-2_5 are sent to SU #2 via routing path 2, EDSs 3_1-3_5are sent to SU #3 via routing path 2 (e.g., SUs #2 and #3 are at thesame geographical location), and EDSs 5_1-5_5 are sent to SU #5 viarouting path #4.

In this example, routing path 2 experiences an error (e.g., a networkdropout or other error) that affects the storage of the third, fourth,and fifth sets of EDSs in SUs #2 and #3. Therefore, SU #2 successfullystores EDSs 2_1-2_2 of the first two sets of EDSs and SU #3 successfullystores EDSs 3_1-3_2 of the first two sets of EDSs. SUs #1, #4, and #5successfully store all encoded data slices of the five sets sent. Basedon error messages from SUs #2 and #3 and/or rebuild requests from SUs #2and #3 (e.g., SUs #2 and #3 include rebuild agents (e.g., integrityprocessing units 20)), computing device 12 or 16 determines that of thefive slices sent from each of set of encoded data slices, five aresuccessfully stored from sets 1 and 2 and three are successfully storedfrom sets 3-5 as shown in routing path 1-6 performance information 84.

To determine the error rate associated with the set of storage units,the number of encoded data slices successfully stored from each set aresubtracted from the number of encoded data slices sent from each setduring the time period to determine one or more error amounts. Forexample, five slices are sent per set to the set of storage units. Allfive slices from sets 1 and 2 are successfully stored making the erroramount for sets 1 and 2 zero. Three slices from sets 3-5 aresuccessfully stored making the error amount for sets 3-5 each two (e.g.,5 slices sent−3 slices successfully stored=2). The one or more erroramounts are then divided by the number of encoded data slices sent perset during the time period to produce one or more encoded data slice seterror rates. For example, the encoded data slice set error rate for sets1 and 2 is 0 (e.g., 0 error amount/5 slices sent=0) and the encoded dataslice set error rate for sets 3-5 is 0.4 (e.g., 2 error amount/5 slicessent=0.4). The encoded data slice set error rates are then averaged todetermine the error rate 86 associated with the set of storage units. Inthis example, the error rate 86 is 0.24 (e.g., 0.4+0.4+0.4+0+0=1.2,1.2/5 storage units=0.24).

The routing path information 84 may additionally include otherinformation pertaining to the set of storage units 82 and the routingpaths 1-6. For example, the identity of storage units with storageerrors could be included in routing path information. If the samestorage units continue to experience errors, corrective measures can beimplemented (e.g., different storage units are selected for storage,different routing paths are selected, defective storage units are takenoffline, etc.).

Based on routing path performance information 84, computing device 12 or16 adjusts dispersed storage error encoding parameters to improvestorage efficiency and/or reliability. For example, computing device 12or 16 adjusts a pillar width (PW) to decode threshold (DT) ratio of adispersed storage error encoding function when the routing pathperformance information 84 deviates from a performance threshold 88. Theperformance threshold 88 includes a first error rate threshold 90 and asecond error rate threshold 92.

As a specific example, first error rate threshold 90 is set at 0.06 andsecond error rate threshold 92 is set at 0.2. First error rate threshold90 is a lower limit of the performance threshold 88 meaning thatanything equal to or lower than first error rate threshold 90 (e.g., anerror rate that compares favorably to the first error rate threshold 90)warrants a change because the performance is determined to be higherthan required and more errors could be tolerated in exchange forefficiency (e.g., faster storage, faster processing, increased storagecapacity, etc.).

Second error rate threshold 92 is an upper limit of the performancethreshold 88 meaning that anything equal to or higher than second errorrate threshold 92 (e.g., an error rate that compares unfavorably to thesecond error rate threshold 92) warrants a change because theperformance is unsatisfactory and greater reliability is needed. Errorrates between 0.06 and 0.2 are acceptable in this example and wouldrequire no change to the pillar width to decode threshold ratio.

In this example, the error rate 86 is 0.24 and is thus higher thansecond error rate threshold 92. Because the error rate 86 comparesunfavorably to the second error rate threshold 92, computing device 12or 16 adjusts the pillar width to decode threshold ratio by increasingthe pillar width number for greater reliability. For example, theoriginal pillar width to decode threshold ratio 94 was PW=5 and DT=3.The adjusted pillar width to decode threshold ratio 96 is now PW=6 andDT=3. Alternatively, when error rate 86 compares unfavorably to thesecond error rate threshold 92, computing device 12 or 16 adjusts thepillar width to decode threshold ratio by increasing the pillar widthnumber as well as increasing the decode threshold number.

Computing device 12 or 16 dispersed storage error encodes a data objectusing the adjusted pillar width to decode threshold ratio to produce aplurality of sets of encoded data slices and sends the plurality of setsof encoded data slices to the set of storage units 82 via the set ofrouting paths 1-6 for storage therein.

FIG. 10 is a schematic block diagram of another embodiment of thedispersed or distributed storage network (DSN) that includes computingdevice 12 or 16 and a set of storage units (SUs) 82. FIG. 10 operatessimilarly to FIG. 9 except that in this example, five sets of encodeddata slices (EDSs) are sent to the set of storage units 82 during a timeperiod where each set has a pillar width (PW) of 8 and a decodethreshold (DT) of 3. Therefore, the five sets of EDSs are sent to alleight storage units of the set of storage units. Further, in thisexample, no routing path errors (or other storage errors) occur suchthat all encoded data slices that are sent for storage are successfullystored in the set of storage units 82. As shown in routing path 1-6performance information 84 eight EDSs are sent from sets 1-5 and eightEDSs from sets 1-5 are successfully stored.

Routing path 1-6 performance information 84 indicates that the errorrate 86 is 0. Computing device 12 or 16 compares error rate 86 to firsterror rate threshold 90 and second error rate threshold 92 to determinewhether the pillar width to decode threshold ratio requires adjustment.Here, the error rate 86 compares favorably to the first error ratethreshold 90 (e.g., 0 is lower than 0.06) and a change to the pillarwidth to decode threshold ratio is warranted for increased efficiency.Therefore, the computing device 12 or 16 adjusts the pillar width todecode threshold ratio by decreasing the pillar width number andmaintaining the decode threshold number.

For example, the original pillar width to decode threshold ratio 94 wasPW=8 and DT=3. The adjusted pillar width to decode threshold ratio 96 isnow PW=6 and DT=3. Alternatively, when error rate 86 compares favorablyto the first error rate threshold 92, computing device 12 or 16 adjuststhe pillar width to decode threshold ratio by maintaining the pillarwidth number and increasing the decode threshold number.

FIG. 11 is a logic diagram of an example of a method of adjustingdispersed error encoding parameters based on routing path performance.The method begins with step 98 where a computing device of a dispersedstorage network (DSN) determines routing path performance information ofa set of routing paths with respect to a set of storage units of theDSN.

Routing path performance information includes a number of encoded dataslices of each of one or more sets of encoded data slices sent to theset of storage units during a time period, a number of encoded dataslices of each of the one or more sets of encoded data slicessuccessfully stored by the set of storage units during the time period,and an error rate associated with the set of storage units based on thenumber of encoded data slices sent and the number of encoded data slicessuccessfully stored.

To determine the error rate associated with the set of storage units,the number of encoded data slices successfully stored are subtractedfrom the number of encoded data slices sent during the time period toproduce one or more error amounts. The one or more error amounts arethen divided by the number of encoded data slices sent per set duringthe time period to produce one or more encoded data slice set errorrates. The encoded data slice set error rates are then averaged todetermine the error rate associated with the set of storage units.

The method continues with step 100 where the computing device adjusts apillar width to decode threshold ratio of a dispersed storage errorencoding function when the routing path performance information deviatesfrom a performance threshold. The performance threshold includes a firsterror rate threshold and a second error rate threshold. For example, theerror rate is compared to the first and second error rate thresholds.When the error rate compares favorably to the first error ratethreshold, the computing device adjusts the pillar width to decodethreshold ratio by decreasing a pillar width number and maintaining adecode threshold number. When the error rate compares unfavorably to thesecond error rate threshold, the computing device adjusts the pillarwidth to decode threshold ratio by increasing the pillar width numberand maintaining the decode threshold number.

As another example, when the error rate compares favorably to the firsterror rate threshold, the computing device adjusts the pillar width todecode threshold ratio by increasing a decode threshold number andmaintaining a pillar width number. As a further example, when the errorrate compares unfavorably to the second error rate threshold, thecomputing device adjusts the pillar width to decode threshold ratio byincreasing the pillar width number and increasing the decode thresholdnumber.

The method continues with step 102 where the computing device dispersedstorage error encodes a data object using the adjusted pillar width todecode threshold ratio to produce a plurality of sets of encoded dataslices. The method continues with step 104 where the computing devicesends the plurality of sets of encoded data slices to the set of storageunits via the set of routing paths for storage therein.

It is noted that terminologies as may be used herein such as bit stream,stream, signal sequence, etc. (or their equivalents) have been usedinterchangeably to describe digital information whose contentcorresponds to any of a number of desired types (e.g., data, video,speech, text, graphics, audio, etc. any of which may generally bereferred to as ‘data’).

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. For some industries, anindustry-accepted tolerance is less than one percent and, for otherindustries, the industry-accepted tolerance is 10 percent or more. Otherexamples of industry-accepted tolerance range from less than one percentto fifty percent. Industry-accepted tolerances correspond to, but arenot limited to, component values, integrated circuit process variations,temperature variations, rise and fall times, thermal noise, dimensions,signaling errors, dropped packets, temperatures, pressures, materialcompositions, and/or performance metrics. Within an industry, tolerancevariances of accepted tolerances may be more or less than a percentagelevel (e.g., dimension tolerance of less than +/−1%). Some relativitybetween items may range from a difference of less than a percentagelevel to a few percent. Other relativity between items may range from adifference of a few percent to magnitude of differences.

As may also be used herein, the term(s) “configured to”, “operablycoupled to”, “coupled to”, and/or “coupling” includes direct couplingbetween items and/or indirect coupling between items via an interveningitem (e.g., an item includes, but is not limited to, a component, anelement, a circuit, and/or a module) where, for an example of indirectcoupling, the intervening item does not modify the information of asignal but may adjust its current level, voltage level, and/or powerlevel. As may further be used herein, inferred coupling (i.e., where oneelement is coupled to another element by inference) includes direct andindirect coupling between two items in the same manner as “coupled to”.

As may even further be used herein, the term “configured to”, “operableto”, “coupled to”, or “operably coupled to” indicates that an itemincludes one or more of power connections, input(s), output(s), etc., toperform, when activated, one or more its corresponding functions and mayfurther include inferred coupling to one or more other items. As maystill further be used herein, the term “associated with”, includesdirect and/or indirect coupling of separate items and/or one item beingembedded within another item.

As may be used herein, the term “compares favorably”, indicates that acomparison between two or more items, signals, etc., provides a desiredrelationship. For example, when the desired relationship is that signal1 has a greater magnitude than signal 2, a favorable comparison may beachieved when the magnitude of signal 1 is greater than that of signal 2or when the magnitude of signal 2 is less than that of signal 1. As maybe used herein, the term “compares unfavorably”, indicates that acomparison between two or more items, signals, etc., fails to providethe desired relationship.

As may be used herein, one or more claims may include, in a specificform of this generic form, the phrase “at least one of a, b, and c” orof this generic form “at least one of a, b, or c”, with more or lesselements than “a”, “b”, and “c”. In either phrasing, the phrases are tobe interpreted identically. In particular, “at least one of a, b, and c”is equivalent to “at least one of a, b, or c” and shall mean a, b,and/or c. As an example, it means: “a” only, “b” only, “c” only, “a” and“b”, “a” and “c”, “b” and “c”, and/or “a”, “b”, and “c”.

As may also be used herein, the terms “processing module”, “processingcircuit”, “processor”, “processing circuitry”, and/or “processing unit”may be a single processing device or a plurality of processing devices.Such a processing device may be a microprocessor, micro-controller,digital signal processor, microcomputer, central processing unit, fieldprogrammable gate array, programmable logic device, state machine, logiccircuitry, analog circuitry, digital circuitry, and/or any device thatmanipulates signals (analog and/or digital) based on hard coding of thecircuitry and/or operational instructions. The processing module,module, processing circuit, processing circuitry, and/or processing unitmay be, or further include, memory and/or an integrated memory element,which may be a single memory device, a plurality of memory devices,and/or embedded circuitry of another processing module, module,processing circuit, processing circuitry, and/or processing unit. Such amemory device may be a read-only memory, random access memory, volatilememory, non-volatile memory, static memory, dynamic memory, flashmemory, cache memory, and/or any device that stores digital information.Note that if the processing module, module, processing circuit,processing circuitry, and/or processing unit includes more than oneprocessing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,processing circuitry and/or processing unit implements one or more ofits functions via a state machine, analog circuitry, digital circuitry,and/or logic circuitry, the memory and/or memory element storing thecorresponding operational instructions may be embedded within, orexternal to, the circuitry comprising the state machine, analogcircuitry, digital circuitry, and/or logic circuitry. Still further notethat, the memory element may store, and the processing module, module,processing circuit, processing circuitry and/or processing unitexecutes, hard coded and/or operational instructions corresponding to atleast some of the steps and/or functions illustrated in one or more ofthe Figures. Such a memory device or memory element can be included inan article of manufacture.

One or more embodiments have been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claims. Further, the boundariesof these functional building blocks have been arbitrarily defined forconvenience of description. Alternate boundaries could be defined aslong as the certain significant functions are appropriately performed.Similarly, flow diagram blocks may also have been arbitrarily definedherein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence couldhave been defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claims. One of average skill in the art will alsorecognize that the functional building blocks, and other illustrativeblocks, modules and components herein, can be implemented as illustratedor by discrete components, application specific integrated circuits,processors executing appropriate software and the like or anycombination thereof.

In addition, a flow diagram may include a “start” and/or “continue”indication. The “start” and “continue” indications reflect that thesteps presented can optionally be incorporated in or otherwise used inconjunction with one or more other routines. In addition, a flow diagrammay include an “end” and/or “continue” indication. The “end” and/or“continue” indications reflect that the steps presented can end asdescribed and shown or optionally be incorporated in or otherwise usedin conjunction with one or more other routines. In this context, “start”indicates the beginning of the first step presented and may be precededby other activities not specifically shown. Further, the “continue”indication reflects that the steps presented may be performed multipletimes and/or may be succeeded by other activities not specificallyshown. Further, while a flow diagram indicates a particular ordering ofsteps, other orderings are likewise possible provided that theprinciples of causality are maintained.

The one or more embodiments are used herein to illustrate one or moreaspects, one or more features, one or more concepts, and/or one or moreexamples. A physical embodiment of an apparatus, an article ofmanufacture, a machine, and/or of a process may include one or more ofthe aspects, features, concepts, examples, etc. described with referenceto one or more of the embodiments discussed herein. Further, from figureto figure, the embodiments may incorporate the same or similarly namedfunctions, steps, modules, etc. that may use the same or differentreference numbers and, as such, the functions, steps, modules, etc. maybe the same or similar functions, steps, modules, etc. or differentones.

While the transistors in the above described figure(s) is/are shown asfield effect transistors (FETs), as one of ordinary skill in the artwill appreciate, the transistors may be implemented using any type oftransistor structure including, but not limited to, bipolar, metal oxidesemiconductor field effect transistors (MOSFET), N-well transistors,P-well transistors, enhancement mode, depletion mode, and zero voltagethreshold (VT) transistors.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of theembodiments. A module implements one or more functions via a device suchas a processor or other processing device or other hardware that mayinclude or operate in association with a memory that stores operationalinstructions. A module may operate independently and/or in conjunctionwith software and/or firmware. As also used herein, a module may containone or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes oneor more memory elements. A memory element may be a separate memorydevice, multiple memory devices, or a set of memory locations within amemory device. Such a memory device may be a read-only memory, randomaccess memory, volatile memory, non-volatile memory, static memory,dynamic memory, flash memory, cache memory, and/or any device thatstores digital information. The memory device may be in a form asolid-state memory, a hard drive memory, cloud memory, thumb drive,server memory, computing device memory, and/or other physical medium forstoring digital information.

While particular combinations of various functions and features of theone or more embodiments have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent disclosure is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

What is claimed is:
 1. A method comprises: dispersed storage errorencoding, by a computing device of a storage network, a data object toproduce a set of encoded data slices; obtaining, by the computingdevice, routing path performance information for a plurality of routingpaths from the computing device to a set of storage units of the storagenetwork; selecting, by the computing device, a first routing path fromthe plurality of routing paths for sending a first subset of the set ofencoded data slices, wherein the first routing path has a performancelevel greater than a first performance threshold; selecting, by thecomputing device, a second routing path from the plurality of routingpaths for sending a second subset of the set of encoded data slices,wherein the second routing path has a performance level less than orequal to the first performance threshold; and sending, by the computingdevice, the first and second subsets of encoded data slices to the setof storage units via the first and second routing paths for storagetherein.
 2. The method of claim 1 further comprises: obtaining data fortransmission to the set of storage units, wherein the data includes thedata object.
 3. The method of claim 1 further comprises: determining oneor more of communication requirements and routing path quality ofservice information for one or more of the plurality of routing paths;and determining the performance level of the first routing path based onthe one or more of communication requirements and routing path qualityof service information.
 4. The method of claim 3, wherein thecommunication requirements comprises a current reliability level for theone or more of the plurality of routing paths.
 5. The method of claim 3,wherein the routing path quality of service information comprises areliability history for the one or more of the plurality of routingpaths.
 6. The method of claim 3, wherein the routing path quality ofservice information comprises a future reliability estimate for the oneor more of the plurality of routing paths.
 7. The method of claim 3,wherein the routing path quality of service information comprises bitjitter information.
 8. The method of claim 3, wherein the routing pathquality of service information comprises security information.
 9. Themethod of claim 1 further comprises: determining an error codingdistributed routing protocol for transmitting the encoded data slices.10. The method of claim 9, wherein the error coding distributed routingprotocol comprises an identity of the plurality of routing paths. 11.The method of claim 9, wherein the error coding distributed routingprotocol comprises a number of subsets of encoded data slices for theset of encoded data slices.
 12. The method of claim 9, wherein the errorcoding distributed routing protocol comprises desired routingperformance for one or more of the first and second subsets of the setof encoded data slices.
 13. The method of claim 9, wherein the errorcoding distributed routing protocol comprises a request for multiplepath transmission for the sending of the set of encoded data slices tothe set of storage units.
 14. The method of claim 9, wherein the errorcoding distributed routing protocol comprises a capacity estimate of theplurality of routing paths.
 15. The method of claim 9, wherein the errorcoding distributed routing protocol comprises a priority indicator forat least one of the first and second subsets of the set of encoded dataslices.
 16. The method of claim 9, wherein the error coding distributedrouting protocol comprises a performance indicator for at least one ofthe first and second subsets of the set of encoded data slices.
 17. Themethod of claim 1, wherein the first routing path comprises a firstplurality of relay units, and wherein the second routing path comprisesa second plurality of relay units.
 18. The method of claim 17, wherein arelay unit of the second plurality of relay units is included in thefirst plurality of relay units.
 19. The method of claim 1, whereindetermining the first subset of the set of encoded data slicescomprises: determining a decode threshold number; and determining thefirst subset of encoded data slices includes at least the decodethreshold number.
 20. The method of claim 19, wherein determining thesecond subset of the set of encoded data slices comprises: determining afirst number of encoded data slices that is included in the first subsetof encoded data slices; determining a pillar width number for the set ofencoded data slices; and determining the second subset of encoded dataslices is equal to the pillar width number minus the first number.